Quantifying over Dynamic Properties of Program Execution
نویسندگان
چکیده
In a pointcut we want to fully specify the points in the execution of a program at which an advice is to be executed. The pointcut languages of current aspect-oriented programming languages only provide limited support for specifying points in the execution that do not directly map to points in the program code. As a result, an aspect programmer has to implement logic to keep track of certain runtime properties manually. This logic is detached from the advice’s pointcut. In this paper, we identify two common patterns of dynamic properties on which advice rely. We present pointcut designators that allow to declaratively specify the join points based on runtime properties in a pointcut and outline a possible implementation.
منابع مشابه
Dynamic Optimization
We distinguish static and dynamic optimization of programs: whereas static optimization modifies a program before runtime and is based only its syntactical structure, dynamic optimization is based on the statistical properties of the input source and examples of program execution. Explanation-based generalization is a commonly used dynamic optimization method, but its effectiveness as a speedup...
متن کاملAn Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems
Consider a multiprocessor with k processors. Assume we are running programs consisting of n processes, n > k. Let Ts(P ) and Td(P ) denote the execution times for the program P with optimal static and dynamic allocations respectively. We derive a general and explicit formula for the optimal execution time ratio g(n; k) = maxTs(P )=Td(P ), where the maximum is taken over all programs P consistin...
متن کاملCombining Symbolic Execution and Model Checking to Reduce Dynamic Program Analysis Overhead
This paper addresses the problem of reducing the runtime monitoring overhead for programs where fine-grained monitoring of events is required. To this end we complement model checking techniques with symbolic reasoning methods and show that, under certain circumstances, code fragments do not affect the validity of underlying properties. We consider safety properties given as regular expressions...
متن کاملQuantifying and Resolving Remote Memory Access Contention on Hardware DSM Multiprocessors
This paper makes the following contributions: It proposes a new methodology for quantifying remote memory access contention on hardware DSM multiprocessors. The most valuable aspect of this methodology is that it assesses the impact of contention on real parallel programs running on real hardware. The methodology uses as input the number of accesses from each DSM node to each page in memory. A ...
متن کاملProperty Based Dynamic Slicing of Object Oriented Programs
Received Jun 12 th , 2015 Revised Aug 20 th , 2015 Accepted Aug 26 th , 2015 Slicing is used for program analysis. It the process of extracting the statements of a program that are relevant to a given computation. Static slicing generates slices for all possible execution of a program helping in program understanding, verification, and maintenance and testing. Dynamic slices are smaller in size...
متن کامل